Approximate Queueing Network Analysis for Nonstationary Demand
نویسندگان
چکیده
منابع مشابه
Approximate MVA Algorithms for Solving Queueing Network ModelsHai
As distributed systems such as Internet and Integrated Services Digital Networks (ISDN) become increasingly complex, the interactions among numerous components and workloads make system performance diicult to predict reliably. It is increasingly important to apply suitable performance evaluation tools to aid system analysis and design, system connguration and capacity planning, and resource man...
متن کاملDynamic Control for Nonstationary Queueing Networks
Nonstationary queueing networks are notoriously difficult to analyze and control. One reason is that steady state analysis and techniques are not useful since the model parameters in practice are not constant and depend on time. In this work, we analyze two optimal control problems for nonstationary Jackson networks with abandonment where our main goal is to optimally control the number of serv...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Demand Systems with Nonstationary Prices
Relative prices are nonstationary and standard root-T inference is invalid for demand systems. But demand systems are nonlinear functions of relative prices, and standard methods for dealing with nonstationarity in linear models cannot be used. Demand system residuals are also frequently found to be highly persistent, further complicating estimation and inference. We propose a variant of the tr...
متن کاملApproximate Analysis of a Multi-Class Open Queueing Network with Class Blocking and Push-out
We study a multi-class queueing network which consists of a finite capacity node (node 0) linked to M parallel finite capacity nodes (nodes 1 to M). M classes of customers are assumed. All customers first join node O. A class i customer after completion of its service at node °always joins the ith node. All service times and inter-arrival times are assumed to be exponentially distributed. The s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.07.784